Characterising graphs with no subdivision of a wheel of bounded diameter
نویسندگان
چکیده
We prove that a graph has an r-bounded subdivision of wheel if and only it does not have graph-decomposition locality r width at most two.
منابع مشابه
Graphs with no 7-wheel subdivision
The subgraph homeomorphism problem, SHP(H), has been shown to be polynomial-time solvable for any fixed pattern graph H , but practical algorithms have been developed only for a few specific pattern graphs. Among these are the wheels with four, five, and six spokes. This paper examines the subgraph homeomorphism problem where the pattern graph is a wheel with seven spokes, and gives a result th...
متن کاملGraphs with no 7-wheel subdivision, version II
The subgraph homeomorphism problem, SHP(H), has been shown to be polynomial-time solvable for any fixed pattern graph H, but practical algorithms have been developed only for a few specific pattern graphs. Among these are the wheels with four, five, and six spokes. This paper examines the subgraph homeomorphism problem where the pattern graph is a wheel with seven spokes, and gives a result tha...
متن کاملGraphs with no induced wheel or antiwheel
A wheel is a graph that consists of a chordless cycle of length at least 4 plus a vertex with at least three neighbors on the cycle. It was shown recently that detecting induced wheels is an NP-complete problem. In contrast, it is shown here that graphs that contain no wheel and no antiwheel have a very simple structure and consequently can be recognized in polynomial time. Four families of gra...
متن کاملDecreasing the diameter of bounded degree graphs
Let fd(G) denote the minimum number of edges that have to be added to a graph G to transform it into a graph of diameter at most d. We prove that for any graph G with maximum degree D and n > n0(D) vertices, f2(G) = n − D − 1 and f3(G) ≥ n − O(D). For d ≥ 4, fd(G) depends strongly on the actual structure of G, not only on the maximum degree of G. We prove that the maximum of fd(G) over all conn...
متن کاملConstructions of hamiltonian graphs with bounded degree and diameter
Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for constructing hamiltonian graphs with n vertices and maximum degree ∆ and diameter O(log n), where n is an arbitrary number. The number of edges is asymptotically bounded by (2− 1 ∆−1 − (∆−2)2 (∆−1)3 )n. In particular, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2023
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2023.01.004